Solving the Robust Design Problem for a Two-Commodity Flow Network with Node Failure
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSurvivable Multi-commodity Network Flow Design; Case of Node Capacities and Arc Failure
This paper was concerned with the problem of designing a survivable multicommodity network with node capacities, which is about selecting a set of fixed-charge arcs in order to build a survivable network with minimum cost and satisfied flow requirements. The system is subject to failure and capacity restriction. Failure is defined as simultaneous failure of arcs. To solve the problem, first, a ...
متن کاملReliable Network Design Problem under Node Failure with Benders Decomposition
The design of telecommunication network with capacity constraints of links, routers and ports of routers is considered in this paper. Specially, we limit each demand flow traversed through a pre-specified maximal number of links (called hops) under node failure scenarios in IP layer network. Such a design must be the most cost-effective and ensure that feasible flows continue to exist even when...
متن کاملRobust and Parallel Solving of a Network Design Problem
Industrial optimization applications must be \robust," i.e., must provide good solutions to problem instances of diierent size and numerical characteristics, and continue to work well when side constraints are added. This paper presents a case study in which this requirement and its consequences on the applicability of diierent optimization techniques have been addressed. An extensive benchmark...
متن کاملACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem
The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Engineering and Applied Sciences
سال: 2020
ISSN: 1941-7020
DOI: 10.3844/ajeassp.2020.837.845